Researchers produce thousands of scholarly documents containing valuable technical knowledge. The community faces the laborious task of reading these documents to identify, extract, and synthesize information. To automate information gathering, document-level question answering (QA) offers a flexible framework where human-posed questions can be adapted to extract diverse knowledge. Finetuning QA systems requires access to labeled data (tuples of context, question and answer). However, data curation for document QA is uniquely challenging because the context (i.e. answer evidence passage) needs to be retrieved from potentially long, ill-formatted documents. Existing QA datasets sidestep this challenge by providing short, well-defined contexts that are unrealistic in real-world applications. We present a three-stage document QA approach: (1) text extraction from PDF; (2) evidence retrieval from extracted texts to form well-posed contexts; (3) QA to extract knowledge from contexts to return high-quality answers -- extractive, abstractive, or Boolean. Using QASPER for evaluation, our detect-retrieve-comprehend (DRC) system achieves a +7.19 improvement in Answer-F1 over existing baselines while delivering superior context selection. Our results demonstrate that DRC holds tremendous promise as a flexible framework for practical scientific document QA.

Radiance Fields (RF) are popular to represent casually-captured scenes for new view generation and have been used for applications beyond it. Understanding and manipulating scenes represented as RFs have to naturally follow to facilitate mixed reality on personal spaces. Semantic segmentation of objects in the 3D scene is an important step for that. Prior segmentation efforts using feature distillation show promise but don't scale to complex objects with diverse appearance. We present a framework to interactively segment objects with fine structure. Nearest neighbor feature matching identifies high-confidence regions of the objects using distilled features. Bilateral filtering in a joint spatio-semantic space grows the region to recover accurate segmentation. We show state-of-the-art results of segmenting objects from RFs and compositing them to another scene, changing appearance, etc., moving closer to rich scene manipulation and understanding. Project Page: https://rahul-goel.github.io/isrf/

Stylized view generation of scenes captured casually using a camera has received much attention recently. The geometry and appearance of the scene are typically captured as neural point sets or neural radiance fields in the previous work. An image stylization method is used to stylize the captured appearance by training its network jointly or iteratively with the structure capture network. The state-of-the-art SNeRF method trains the NeRF and stylization network in an alternating manner. These methods have high training time and require joint optimization. In this work, we present StyleTRF, a compact, quick-to-optimize strategy for stylized view generation using TensoRF. The appearance part is fine-tuned using sparse stylized priors of a few views rendered using the TensoRF representation for a few iterations. Our method thus effectively decouples style-adaption from view capture and is much faster than the previous methods. We show state-of-the-art results on several scenes used for this purpose.

There has been significant progress in developing neural network architectures that both achieve high predictive performance and that also achieve high application-level inference throughput (e.g., frames per second). Another metric of increasing importance is GPU utilization during inference: the measurement of how well a deployed neural network uses the computational capabilities of the GPU on which it runs. Achieving high GPU utilization is critical to increasing application-level throughput and ensuring a good return on investment for deploying GPUs. This paper analyzes the GPU utilization of convolutional neural network (CNN) inference. We first survey the GPU utilization of CNNs to show that there is room to improve the GPU utilization of many of these CNNs. We then investigate the GPU utilization of networks within a neural architecture search (NAS) search space, and explore how using GPU utilization as a metric could potentially be used to accelerate NAS itself. Our study makes the case that there is room to improve the inference-time GPU utilization of CNNs and that knowledge of GPU utilization has the potential to benefit even applications that do not target utilization itself. We hope that the results of this study will spur future innovation in designing GPU-efficient neural networks.

We introduce an information-maximization approach for the Generalized Category Discovery (GCD) problem. Specifically, we explore a parametric family of loss functions evaluating the mutual information between the features and the labels, and find automatically the one that maximizes the predictive performances. Furthermore, we introduce the Elbow Maximum Centroid-Shift (EMaCS) technique, which estimates the number of classes in the unlabeled set. We report comprehensive experiments, which show that our mutual information-based approach (MIB) is both versatile and highly competitive under various GCD scenarios. The gap between the proposed approach and the existing methods is significant, more so when dealing with fine-grained classification problems. Our code: \url{https://github.com/fchiaroni/Mutual-Information-Based-GCD}.

We have designed three search methods for producing the task trees for the provided goal nodes using the Functional Object-Oriented Network. This paper details the strategy, the procedure, and the outcomes.

This work proposes Multi-task Meta Learning (MTML), integrating two learning paradigms Multi-Task Learning (MTL) and meta learning, to bring together the best of both worlds. In particular, it focuses simultaneous learning of multiple tasks, an element of MTL and promptly adapting to new tasks with fewer data, a quality of meta learning. It is important to highlight that we focus on heterogeneous tasks, which are of distinct kind, in contrast to typically considered homogeneous tasks (e.g., if all tasks are classification or if all tasks are regression tasks). The fundamental idea is to train a multi-task model, such that when an unseen task is introduced, it can learn in fewer steps whilst offering a performance at least as good as conventional single task learning on the new task or inclusion within the MTL. By conducting various experiments, we demonstrate this paradigm on two datasets and four tasks: NYU-v2 and the taskonomy dataset for which we perform semantic segmentation, depth estimation, surface normal estimation, and edge detection. MTML achieves state-of-the-art results for most of the tasks. Although semantic segmentation suffers quantitatively, our MTML method learns to identify segmentation classes absent in the pseudo labelled ground truth of the taskonomy dataset.

来自多个RGB摄像机的无标记人类运动捕获（MOCAP）是一个广泛研究的问题。现有方法要么需要校准相机，要么相对于静态摄像头校准它们，该摄像头是MOCAP系统的参考框架。每个捕获会话都必须先验完成校准步骤，这是一个乏味的过程，并且每当有意或意外移动相机时，都需要重新校准。在本文中，我们提出了一种MOCAP方法，该方法使用了多个静态和移动的外部未校准的RGB摄像机。我们方法的关键组成部分如下。首先，由于相机和受试者可以自由移动，因此我们选择接地平面作为常见参考，以代表身体和相机运动，与代表摄像机坐标中身体的现有方法不同。其次，我们了解相对于接地平面的短人类运动序列（$ \ sim $ 1SEC）的概率分布，并利用它在摄像机和人类运动之间消除歧义。第三，我们将此分布用作一种新型的多阶段优化方法的运动，以适合SMPL人体模型，并且摄像机在图像上的人体关键点构成。最后，我们证明我们的方法可以在从航空摄像机到智能手机的各种数据集上使用。与使用静态摄像头的单眼人类MOCAP任务相比，它还提供了更准确的结果。我们的代码可在https://github.com/robot-ception-group/smartmocap上进行研究。

在此评论中，我们为模糊C均值问题的“迭代重新加权算法”中提出了一个简单的替代推导。我们表明，对于IRW-FCM算法而得出的迭代步骤不过是流行的多数化最小化（MM）算法的步骤。本说明中提出的推导更简单明了，与IRW-FCM的推导不同，此处的推导不涉及引入任何辅助变量。此外，通过将IRW-FCM的步骤显示为MM算法，可以消除IRW-FCM算法的内环，并且可以有效地作为“单个环”算法运行算法。更确切地说，新的基于MM的推导推论IRW-FCM的单个内部环足够降低模糊C均值的目标函数，从而加快了IRW-FCM算法的速度。

公路障碍检测是一个重要的研究领域，属于智能运输基础设施系统的范围。基于视觉的方法的使用为此类系统提供了准确且具有成本效益的解决方案。在这篇研究论文中，我们提出了一种使用仪表板视频的自动驾驶自动驾驶汽车的威胁检测机制，以确保在其视觉范围内的道路上存在任何不必要的障碍物。此信息可以帮助车辆的计划安全。有四个主要组件，即Yolo来识别对象，高级车道检测算法，多回归模型，用于测量对象与摄像机的距离，测量安全速度的两秒钟规则和限制速度。此外，我们已经使用了车祸数据集（CCD）来计算模型的准确性。Yolo算法的精度约为93％。我们提出的威胁检测模型（TDM）的最终准确性为82.65％。